Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE
نویسندگان
چکیده
In this paper, we examine “program. adjustment”. a formal and practical approach to developing correct concurrent programs. by automatically adjusting an, imperfect program to satisfy given constraints. A concurrent program is modeled by a finite state process, and program adjustment to satisfy temporal logic constraints is formalized as the synthesis of an arbiter process which partially serializes target (i.e. imperfect) processes to remove harmful nondeterministic behaviors. Compositional adjustment is also proposed for large-scale compou.nd target processes. using process equivalence theory. We ha.ve developed a computer-aided programming environ,ment on the parallel computer Multi-PSI. called MENDELS ZONE, that adopts th,is compositional adjustment. Adjusted programs can be com,piled into the kernel lan,guage (KLl) and executed on Multi-PSI.
منابع مشابه
On Using Temporal Logic for Refinement and Compositional Verification of Concurrent Systems
A simple and elegant formulation of compositional proof systems for concurrent programs results from a reenement of temporal logic semantics. The reened temporal language we propose is closed under w-stuttering and, thus, provides a fully abstract semantics with respect to some chosen observation level w. This avoids incorporating irrelevant detail in the temporal semantics of parallel programs...
متن کاملA Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs
A simple and elegant formulation of compositional proof systems for concurrent programs results from a reenement of temporal logic semantics. The reened temporal language we propose is closed under w-stuttering and, thus, provides a fully abstract semantics with respect to some chosen observation level w. This avoids incorporating irrelevant detail in the temporal semantics of parallel programs...
متن کاملDeclarative Diagnosis of Temporal Concurrent Constraint Programs
We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check ...
متن کاملVerifying concurrent systems with symbolic execution: temporal reasoning is symbolic execution with a little induction
Symbolic execution is an intuitive strategy to verify sequential programs, which can be automated to a large extent. We have successfully carried over this method of proof to the interactive verification of concurrent systems. The resulting strategy can be applied to the verification of complex parallel programs and arbitrary (linear) temporal formulas. Our underlying logic is defined such that...
متن کاملPartial-order verification in SPIN can be more efficient
Partial-order reduction methods form a collection of state exploration techniques set to relieve the stateexplosion problem in concurrent program verification. One such method is implemented in the verification tool SPIN. Its use often reduces significantly the memory and time needed for verifying local and termination properties of concurrent programs and, moreover, for verifying that concurre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Systems and Software
دوره 33 شماره
صفحات -
تاریخ انتشار 1995